Termination of Rule-Based Calculi for Uniform Semi-Unification
Identifieur interne : 001470 ( Main/Exploration ); précédent : 001469; suivant : 001471Termination of Rule-Based Calculi for Uniform Semi-Unification
Auteurs : Takahito Aoto [Japon] ; Munehiro Iwami [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Uniform semi-unification is a generalization of unification; its efficient algorithms have been extensively studied in (Kapur et al., 1994) and (Oliart&Snyder, 2004). For (uniform) semi-unification, several variants of rule-based calculi are known. But, some of these calculi in the literature lack the termination property, i.e. not all derivations are terminating. We revisit symbolic semi-unification whose solvability coincides with that of uniform semi-unification. We give an abstract criterion of the strategy on which a general rule-based calculus for symbolic semi-unification terminates. Based on this, we give an alternative and robust correctness proof of a rule-based uniform semi-unification algorithm.
Url:
DOI: 10.1007/978-3-642-37064-9_7
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001625
- to stream Istex, to step Curation: 001606
- to stream Istex, to step Checkpoint: 000096
- to stream Main, to step Merge: 001482
- to stream Main, to step Curation: 001470
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Termination of Rule-Based Calculi for Uniform Semi-Unification</title><author><name sortKey="Aoto, Takahito" sort="Aoto, Takahito" uniqKey="Aoto T" first="Takahito" last="Aoto">Takahito Aoto</name></author><author><name sortKey="Iwami, Munehiro" sort="Iwami, Munehiro" uniqKey="Iwami M" first="Munehiro" last="Iwami">Munehiro Iwami</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5F8E0E670421C435BF456F6853324B4697EE42C9</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-37064-9_7</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-LL3F1QKQ-L/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001625</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001625</idno><idno type="wicri:Area/Istex/Curation">001606</idno><idno type="wicri:Area/Istex/Checkpoint">000096</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000096</idno><idno type="wicri:doubleKey">0302-9743:2013:Aoto T:termination:of:rule</idno><idno type="wicri:Area/Main/Merge">001482</idno><idno type="wicri:Area/Main/Curation">001470</idno><idno type="wicri:Area/Main/Exploration">001470</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Termination of Rule-Based Calculi for Uniform Semi-Unification</title><author><name sortKey="Aoto, Takahito" sort="Aoto, Takahito" uniqKey="Aoto T" first="Takahito" last="Aoto">Takahito Aoto</name><affiliation wicri:level="4"><country xml:lang="fr">Japon</country><wicri:regionArea>RIEC, Tohoku University</wicri:regionArea><placeName><settlement type="city">Sendai</settlement><region type="province">Région de Tōhoku</region></placeName><orgName type="university">Université du Tōhoku</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author><author><name sortKey="Iwami, Munehiro" sort="Iwami, Munehiro" uniqKey="Iwami M" first="Munehiro" last="Iwami">Munehiro Iwami</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>Dept. of Mathematics and Computer Science, Interdisciplinary Faculty of Science and Engineering, Shimane University</wicri:regionArea><wicri:noRegion>Shimane University</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Uniform semi-unification is a generalization of unification; its efficient algorithms have been extensively studied in (Kapur et al., 1994) and (Oliart&Snyder, 2004). For (uniform) semi-unification, several variants of rule-based calculi are known. But, some of these calculi in the literature lack the termination property, i.e. not all derivations are terminating. We revisit symbolic semi-unification whose solvability coincides with that of uniform semi-unification. We give an abstract criterion of the strategy on which a general rule-based calculus for symbolic semi-unification terminates. Based on this, we give an alternative and robust correctness proof of a rule-based uniform semi-unification algorithm.</div></front></TEI><affiliations><list><country><li>Japon</li></country><region><li>Région de Tōhoku</li></region><settlement><li>Sendai</li></settlement><orgName><li>Université du Tōhoku</li></orgName></list><tree><country name="Japon"><region name="Région de Tōhoku"><name sortKey="Aoto, Takahito" sort="Aoto, Takahito" uniqKey="Aoto T" first="Takahito" last="Aoto">Takahito Aoto</name></region><name sortKey="Aoto, Takahito" sort="Aoto, Takahito" uniqKey="Aoto T" first="Takahito" last="Aoto">Takahito Aoto</name><name sortKey="Iwami, Munehiro" sort="Iwami, Munehiro" uniqKey="Iwami M" first="Munehiro" last="Iwami">Munehiro Iwami</name><name sortKey="Iwami, Munehiro" sort="Iwami, Munehiro" uniqKey="Iwami M" first="Munehiro" last="Iwami">Munehiro Iwami</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001470 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001470 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5F8E0E670421C435BF456F6853324B4697EE42C9
|texte= Termination of Rule-Based Calculi for Uniform Semi-Unification
}}
| This area was generated with Dilib version V0.6.33. |  |